Strictly extreme and strictly exposed points
نویسندگان
چکیده
منابع مشابه
On Fixed Points of Strictly Causal Functions
We ask whether strictly causal components form well defined systems when arranged in feedback configurations. The standard interpretation for such configurations induces a fixed-point constraint on the function modelling the component involved. We define strictly causal functions formally, and show that the corresponding fixed-point problem does not always have a well defined solution. We exami...
متن کاملStrictly Temporally Periodic Points in Cellular Automata
We study the set of strictly temporally periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but are not spatially periodic. This set turns out to be residual for equicontinuous surjective cellular automata, dense for almost equicontinuous surjective cellular automata, while it is empty for the positively expa...
متن کاملStrictly Pretty
Pretty printers are tools for formatting structured text. A recently taken algebraic approach has lead to a systematic design of pretty printers. Wadler has proposed such an algebraic pretty printer together with an implementation for the lazy functional language Haskell. The original design causes exponential complexity when literally used in a strict language. This note recalls some propertie...
متن کاملStrictly Check below Common Points before Submission of Your Article
Objective: The objective of this research was to formulate and evaluate pectin and HPMC different grades mucoadhesive microspheres in combination with sodium alginate for controlled release of maraviroc. Methods: The maraviroc mucoadhesive microspheres was successfully developed by Ionotropic gelation technique, using sodium alginate, pectin, HPMC K4, K15, and K100 as mucoadhesive polymer in va...
متن کاملConstructing Strictly Positive Families
In order to represent, compute and reason with advanced data types one must go beyond the traditional treatment of data types as being inductive types and, instead, consider them as inductive families. Strictly positive types (SPTs) form a grammar for defining inductive types and, consequently, a fundamental question in the the theory of inductive families is what constitutes a corresponding gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 1994
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s0161171294000657